Perfect simplices in $${\mathbb R}^5$$ R 5

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hitting Simplices with Points in R

The so-called first selection lemma states the following: given any set P of n points in R, there exists a point in R contained in at least cdn − O(n) simplices spanned by P , where the constant cd depends on d. We present improved bounds on the first selection lemma in R. In particular, we prove that c3 ≥ 0.00227, improving the previous best result of c3 ≥ 0.00162 by Wagner [Wag03]. This makes...

متن کامل

Repeated Root Constacyclic Codes of Length $mp^s$ over $\mathbb{F}_{p^r}+u \mathbb{F}_{p^r}+...+ u^{e-1}\mathbb{F}_{p^r}$

We give the structure of λ-constacyclic codes of length pm over R = Fpr +uFpr + . . .+uFpr with λ ∈ F ∗ pr . We also give the structure of λ-constacyclic codes of length pm with λ = α1 + uα2 + . . .+ u αe−1, where α1, α2 6= 0 and study the self-duality of these codes.

متن کامل

Some results on $\mathbb{R}$-computable structures

This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction technique, effective categoricity, effective topology, and relations with other models for the effective theory of uncountable structures.

متن کامل

Perfect matchings in r-partite r-graphs

Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H , each satisfying the following condition: the degree of each legal r−1-tuple contained in the complement of this side is strictly larger than n 2 . We prove that under this condition H must have a perfect matching. This answers a question of Kühn and Osthus.

متن کامل

Simplices and Sets of Positive Upper Density in R

We prove an extension of Bourgain’s theorem on pinned distances in measurable subset of R2 of positive upper density, namely Theorem 1′ in [1], to pinned non-degenerate k-dimensional simplices in measurable subset of Rd of positive upper density whenever d ≥ k + 2 and k is any positive integer.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry

سال: 2018

ISSN: 0138-4821,2191-0383

DOI: 10.1007/s13366-018-0386-6